for _ in range(int(input())):
a,b,c=map(int,input().split())
x=abs(a-1)
y=abs(b-c)+abs(c-1)
if(x==y):
print('3')
elif(x<y):
print('1')
else:
print('2')#include <bits/stdc++.h>
#define Fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
#define ll long long
const ll mod = 1e9 + 7;
#define e cout<<'\n';
using namespace std;
int main() {
Fast
ll t;
cin >> t;
while (t--) {
ll a, b, c;
cin >> a >> b >> c;
if (c > b) {
if (a - 1 < abs(c - b) + c - 1) {
cout << 1;
e
} else if (a - 1 > abs(c - b) + c - 1) {
cout << 2;
e
} else {
cout << 3;
e
}
} else {
if (a < b) {
cout << 1;
e
} else if (b < a) {
cout << 2;
e
} else {
cout << 3;
e
}
}
}
} 559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |
1704. Determine if String Halves Are Alike | 1732. Find the Highest Altitude |